Stochastic Ordering of Infinite Geometric Galton–Watson Trees

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Matrix-Geometric Solution of Infinite Stochastic Petri Nets

I n this paper we characterize a class of stochastic Petri nets that can be solved using matrix geometric techniques. Advantages of such a n approach are that very efficient mathematical technique become available for practical usage, as well as that the problem of large state spaces can be circumvented. W e first characterize the class of stochastic Petri nets of interest by formally defining ...

متن کامل

Geometric Programming with Stochastic Parameter

Geometric programming is efficient tool for solving a variety of nonlinear optimizationproblems. Geometric programming is generalized for solving engineering design. However,Now Geometric programming is powerful tool for optimization problems where decisionvariables have exponential form.The geometric programming method has been applied with known parameters. However,the observed values of the ...

متن کامل

Ordering infinite utility streams

We reconsider the problem of ordering infinite utility streams. As has been established in earlier contributions, if no representability condition is imposed, there exist strongly Paretian and finitely anonymous orderings of intertemporal utility streams.We examine the possibility of adding suitably formulated versions of classical equity conditions. First, we provide a characterization of all ...

متن کامل

Ordering Constraints on Trees

We survey recent results about ordering constraints on trees and discuss their applications. Our main interest lies in the family of recursive path orderings which enjoy the properties of being total, well-founded and compatible with the tree constructors. The paper includes some new results, in particular the undecidability of the theory of lexicographic path orderings in case of a non-unary s...

متن کامل

Convexification of Stochastic Ordering

We consider sets defined by the usual stochastic ordering relation and by the second order stochastic dominance relation. Under fairy general assumptions we prove that in the space of integrable random variables the closed convex hull of the first set is equal to the second set.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Theoretical Probability

سال: 2015

ISSN: 0894-9840,1572-9230

DOI: 10.1007/s10959-015-0608-x